Parameterized Pre-Coloring Extension and List Coloring Problems
نویسندگان
چکیده
Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of following problems by k: (1) Given a graph G, clique modulator D (a is set vertices, whose removal results in clique) size k for list L(v) colors every v ∈ V(G), decide whether G has proper coloring; (2) pre-coloring λ_P: X → Q ⊆ λ_P can be extended coloring using only from Q. For Problem 1 we design an O*(2^k)-time randomized algorithm 2 obtain kernel with at most 3k vertices. Banik et al. (IWOCA 2019) proved problem fixed-parameter tractable it admits polynomial kernel: integer k, exactly n-k there G. We O(k²) vertices compression variation O(k) colors.
منابع مشابه
Between coloring and list-coloring: μ-coloring
A new variation of the coloring problem, μ-coloring, is defined in this paper. Given a graph G and a function μ, a μ-coloring is a coloring where each vertex v of G must receive a color at most μ(v). It is proved that μ-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. The notion of perfection is extended for μ-coloring, l...
متن کاملExtension of a list coloring problem
For a graph H , f (H ) is the smallest integer k such that the join of H with an empty graph Ek of order k is not |V (H )|-choosable. It was conjectured that for a triangle-free graph G, f (G) = ( 2 )μ(G) nn−2μ(G), where n = |V (G)| and μ(G) is the cardinality of a maximum matching of graph G [S. Gravier, F. Maffray, B. Mohar, On a list-coloring problem, Discrete Math. 268 (2003) 303–308]. We v...
متن کاملParameterized Coloring Problems on Chordal Graphs
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two parameterized versions of the problem are studied in the paper: either the number of precolored vertices or the number of colors used in the precolo...
متن کاملIncremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that each vertex has one of the colors specified by its associated list containing some of in total k colors. We introduce the “conservative version” of this problem by adding a further parameter c ∈ specifying the maxi...
متن کاملParameterized Maximum Path Coloring
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1323369